On Multiple Round Sponsored Search Auctions with Budgets

نویسندگان

  • Riccardo Colini-Baldeschi
  • Monika Henzinger
  • Stefano Leonardi
  • Martin Starnberger
چکیده

In a sponsored search auction the advertisement slots on a search result page are generally ordered by click-through rate. Bidders have a valuation, which is usually assumed to be linear in the click-through rate, a budget constraint, and receive at most one slot per search result page (round). We study multi-round sponsored search auctions, where the different rounds are linked through the budget constraints of the bidders and the valuation of a bidder for all rounds is the sum of the valuations for the individual rounds. All mechanisms published so far either study one-round sponsored search auctions [1, 2] or the setting where every round has only one slot and all slots have the same click-through rate, which is identical to a multi-item auction [7]. This paper contains the following three results: (1) We give the first mechanism for the multiround sponsored search problem where different slots have different click-through rates. Our mechanism is incentive compatible in expectation, individually rational in expectation, Pareto optimal in expectation, and also ex-post Pareto optimal for each realized outcome. (2) Additionally we study the combinatorial setting, where each bidder is only interested in a subset of the rounds. We give a deterministic, incentive compatible, individually rational, and Pareto optimal mechanism for the setting where all slots have the same click-through rate. (3) We present an impossibility result for auctions where bidders have diminishing marginal valuations. Specifically, we show that even for the multi-unit (one slot per round) setting there is no incentive compatible, individually rational, and Pareto optimal mechanism for private diminishing marginal valuations and public budgets. Sapienza University of Rome, Via ariosto 25, I-00185 Rome, Italy, Email: [email protected] University of Vienna, Universitätsstraße 10/9, A-1090 Vienna, Austria, Email: [email protected] Sapienza University of Rome, Via ariosto 25, I-00185 Rome, Italy, Email: [email protected] University of Vienna, Universitätsstraße 10/9, A-1090 Vienna, Austria, Email: [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-unit Auctions with Budget Constraints

Motivated by sponsored search auctions, we study multi-unit auctions with budget constraints. In the mechanism we propose, Sort-Cut, understating budgets or values is weakly dominated. Since Sort-Cut’s revenue is increasing in budgets and values, all kinds of equilibrium deviations from true valuations turn out to be bene…cial to the auctioneer. We show that the revenue of Sort-Cut can be an or...

متن کامل

Envy-Free Sponsored Search Auctions with Budgets

We study the problem of designing envy-free sponsored search auctions, where bidders are budgetconstrained. Our primary goal is to design auctions that maximize social welfare and revenue — two classical objectives in auction theory. For this purpose, we characterize envy-freeness with budgets by proving several elementary properties including consistency, monotonicity and transitivity. Based o...

متن کامل

Models for Budget Constrained Auctions: an Application to Sponsored Search & Other Auctions

Title of dissertation: MODELS FOR BUDGET CONSTRAINED AUCTIONS: AN APPLICATION TO SPONSORED SEARCH & OTHER AUCTIONS Abhishek Pani, Doctor of Philosophy, 2010 Dissertation directed by: Professor Subramanian Raghavan Robert H. Smith School of Business The last decade has seen the emergence of auction mechanisms for pricing and allocating goods on the Internet. A successful application area for auc...

متن کامل

Sequential Incremental-Value Auctions

We study the distributed allocation of tasks to cooperating robots in real time, where each task has to be assigned to exactly one robot so that the sum of the latencies of all tasks is as small as possible. We propose a new auction-like algorithm, called Sequential Incremental-Value (SIV) auction, which assigns tasks to robots in multiple rounds. The idea behind SIV auctions is to assign as ma...

متن کامل

Truthful unit-demand auctions with budgets revisited

We consider auctions of indivisible items to unit-demand bidders with budgets. This setting was suggested as an expressive model for single sponsored search auctions. Prior work presented mechanisms that compute bidder-optimal outcomes and are truthful for a restricted set of inputs, i.e., inputs in so-called general position. This condition is easily violated. We provide the first mechanism th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1112.6361  شماره 

صفحات  -

تاریخ انتشار 2011